Numerical irreducibility criteria for handlebody links
نویسندگان
چکیده
منابع مشابه
Irreducibility Criteria for Local and Global Representations
It is proved that certain types of modular cusp forms generate irreducible automorphic representations of the underlying algebraic group. Analogous Archimedean and non-Archimedean local statements are also given. Introduction One of the motivations for this paper was to show that full level cuspidal Siegel eigenforms generate irreducible, automorphic representations of the adelic symplectic sim...
متن کاملNumerical modeling of links behavior in eccentric bracings with dual vertical links
Configuration and geometry of bracing systems affect the seismic performance of structures significantly. Recently, the current authors have introduced a new configuration for eccentric bracing of structural frames that may be assumed as the combination of inverted Y-type and rotated K-type EBFs. The resulted braced frame is called EBF-DVL, consisting of two vertical links attached together by ...
متن کاملNumerical criteria for integral dependence
We study multiplicity based criteria for integral dependence of modules or of standard graded algebras, known as ‘Rees criteria’. Rather than using the known numerical invariants, we achieve this goal with a more direct approach by introducing a multiplicity defined as a limit superior of a sequence of normalized lengths; this multiplicity is a non-negative real number that can be irrational.
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولTesting modules for irreducibility
A practical method is described for deciding whether or not a nite-dimensional module for a group over a nite eld is reducible or not. In the reducible case, an explicit submodule is found. The method is a generalisation of the Parker-Norton`Meataxe' algorithm, but it does not depend for its eeciency on the eld being small. The principal tools involved are the calculation of the nullspace and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2020
ISSN: 0166-8641
DOI: 10.1016/j.topol.2020.107361